On D(n; q) quotients of large girth and hidden homomorphism based cryptographic protocols
نویسندگان
چکیده
منابع مشابه
Some attacks on quantum-based cryptographic protocols
Quantum-based cryptographic protocols are often said to enjoy security guaranteed by the fundamental laws of physics. However, even carefully designed quantum-based cryptographic schemes may be susceptible to subtle attacks that are outside the original design. As an example, we will give a peeking attack against a quantum key distribution scheme based on quantum memory. As a second example, we...
متن کاملConstraints-based Verification of Parameterized Cryptographic Protocols
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroder very few address the more challenging class of group protocols. We present a synchronous model for group protocols, that generalizes st...
متن کاملTransducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for instance, by single rewrite rules—we call these protocols non-looping— and (2) protocols, such as group protocols, where the protocol steps are complex and typically involve an iterative or recursive computation—we call the...
متن کاملModel-Based Testing of Cryptographic Protocols
Modeling is a popular way of representing the behavior of a system. A very useful type of model in computing is an abstract state machine which describes transitions over first order structures. The general purpose model-based testing tool SpecExplorer (used within Microsoft, also available externally) uses such a model, written in AsmL or Spec#, to perform a search that checks that all reachab...
متن کاملComplexity dichotomy for oriented homomorphism of planar graphs with large girth
We consider the complexity of oriented homomorphism and two of its variants, namely strong oriented homomorphism and pushable homomorphism, for planar graphs with large girth. In each case, we consider the smallest target graph such that the corresponding homomorphism is NP-complete. These target graphs T4, T5, and T6 have 4, 5, and 6 vertices, respectively. For i ∈ {4, 5, 6} and for every g, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems (FedCSIS), 2019 Federated Conference on
سال: 2022
ISSN: ['2300-5963']
DOI: https://doi.org/10.15439/2022f54